Vertex Disjoint Quadrilaterals in Graph

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vertex disjoint cycles in a directed graph

Let D be a directed graph of order n 4 and minimum degree at least (3n 3)/2. Let n = nI + n2 where nl 2 and n2 2. Then D contains two vertex-disjoint directed cycles of nI and n2 respectively. The result is sharp if n ~ 6: we give counterexamples if the condition on the minimum degree is relaxed. 1 Introduction We discuss only finite simple graphs and strict and use standard terminology and not...

متن کامل

Degree sum conditions and vertex-disjoint cycles in a graph

We consider degree sum conditions and the existence of vertex-disjoint cycles in a graph. In this paper, we prove the following: Suppose that G is a graph of order at least 3k + 2 and σ3(G) ≥ 6k − 2, where k ≥ 2. Then G contains k vertex-disjoint cycles. The degree and order conditions are sharp.

متن کامل

Vertex-Disjoint Cycles Containing Specified Vertices in a Graph

Let k ≥ 2 and n ≥ 1 be integers, and let G be a graph of order n with minimum degree at least k + 1 . Let v1, v2, . . . vk be k distinct vertices of G , and suppose that there exist vertex-disjoint cycles C1, C2, . . . , Ck in G such that ∑k i=1 |V (C i)| ≥ 399 100 k and vi ∈ V (Ci) for each 1 ≤ i ≤ k . Suppose further that the minimum value of the sum of the degrees of two nonadjacent distinct...

متن کامل

Vertex-disjoint cycles containing specified edges in a bipartite graph

Dirac and Ore-type degree conditions are given for a bipartite graph to contain vertex disjoint cycles each of which contains a previously specified edge. This solves a conjecture of Wang in [6].

متن کامل

On vertex-disjoint complete subgraphs of a graph

We conjecture that if G is a graph of order sk, where s ~3 and k 2: 1 are integers, and d(x)+d(y) ~ 2(s-1)k for every pair of non-adjacent vertices x and y of G, then G contains k vertex-disjoint complete subgraphs of order s. This is true when s = 3, [6]. Here we prove this conjecture for k ~ 6.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2016

ISSN: 2324-7991,2324-8009

DOI: 10.12677/aam.2016.53049